close this message
arXiv smileybones

arXiv Is Hiring a DevOps Engineer

Work on one of the world's most important websites and make an impact on open science.

View Jobs
Skip to main content
Cornell University

arXiv Is Hiring a DevOps Engineer

View Jobs
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > cs > arXiv:1505.05571

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Computer Science > Numerical Analysis

arXiv:1505.05571 (cs)
[Submitted on 21 May 2015]

Title:Fast exact summation using small and large superaccumulators

Authors:Radford M. Neal
View a PDF of the paper titled Fast exact summation using small and large superaccumulators, by Radford M. Neal
View PDF
Abstract:I present two new methods for exactly summing a set of floating-point numbers, and then correctly rounding to the nearest floating-point number. Higher accuracy than simple summation (rounding after each addition) is important in many applications, such as finding the sample mean of data. Exact summation also guarantees identical results with parallel and serial implementations, since the exact sum is independent of order. The new methods use variations on the concept of a "superaccumulator" - a large fixed-point number that can exactly represent the sum of any reasonable number of floating-point values. One method uses a "small" superaccumulator with sixty-seven 64-bit chunks, each with 32-bit overlap with the next chunk, allowing carry propagation to be done infrequently. The small superaccumulator is used alone when summing a small number of terms. For big summations, a "large" superaccumulator is used as well. It consists of 4096 64-bit chunks, one for every possible combination of exponent bits and sign bit, plus counts of when each chunk needs to be transferred to the small superaccumulator. To add a term to the large superaccumulator, only a single chunk and its associated count need to be updated, which takes very few instructions if carefully implemented. On modern 64-bit processors, exactly summing a large array using this combination of large and small superaccumulators takes less than twice the time of simple, inexact, ordered summation, with a serial implementation. A parallel implementation using a small number of processor cores can be expected to perform exact summation of large arrays at a speed that reaches the limit imposed by memory bandwidth. Some common methods that attempt to improve accuracy without being exact may therefore be pointless, at least for large summations, since they are slower than computing the sum exactly.
Subjects: Numerical Analysis (math.NA); Distributed, Parallel, and Cluster Computing (cs.DC); Computation (stat.CO)
ACM classes: G.1.0
Cite as: arXiv:1505.05571 [cs.NA]
  (or arXiv:1505.05571v1 [cs.NA] for this version)
  https://doi.org/10.48550/arXiv.1505.05571
arXiv-issued DOI via DataCite

Submission history

From: Radford M. Neal [view email]
[v1] Thu, 21 May 2015 01:17:04 UTC (154 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Fast exact summation using small and large superaccumulators, by Radford M. Neal
  • View PDF
  • TeX Source
  • Other Formats
view license
Ancillary-file links:

Ancillary files (details):

  • Makefile-clang-intel
  • Makefile-gcc-arm
  • Makefile-gcc-intel
  • Makefile-gcov
  • Makefile-solaris-sparc
  • README
  • check.r
  • clean-gcov
  • compile
  • pbinary.c
  • pbinary.h
  • plots.r
  • resdiff
  • resshasum
  • results-apps-gcc-4.6.3
  • results-aspireV5-clang-3.5.0
  • results-aspireV5-gcc-4.8.2
  • results-cdf-gcc-4.6.3
  • results-comps-gcc-4.8.2
  • results-cubox-gcc-4.8.4
  • results-dell-350-gcc-4.6.3
  • results-dell-530-clang-3.4
  • results-dell-530-gcc-4.6.4
  • results-dell-530-gcc-4.7.3
  • results-dell-530-gcc-4.8.1
  • results-dell-530-gcc-4.9.2
  • results-dell-T1600-clang-3.5.0
  • results-dell-T1600-gcc-4.9.2
  • results-dell-T7500-clang-3.4
  • results-dell-T7500-gcc-4.6.4
  • results-dell-T7500-gcc-4.7.3
  • results-dell-T7500-gcc-4.8.1
  • results-dell-T7500-gcc-4.9.2
  • results-dell-gx200-clang-3.4
  • results-dell-gx200-gcc-4.6.3
  • results-gateway-clang-3.5.0
  • results-gateway-gcc-4.8.2
  • results-macbookpro-clang-3.6.0
  • results-macpro-clang-3.5
  • results-macpro-gcc-4.7.3
  • results-pi-gcc-4.6.3
  • results-sun-T5140
  • results-sun-V880
  • run-tests
  • show.c
  • system-apps
  • system-aspireV5
  • system-cdf
  • system-comps
  • system-cubox
  • system-dell-350
  • system-dell-530
  • system-dell-T1600
  • system-dell-T7500
  • system-dell-gx200
  • system-gateway
  • system-macbookpro
  • system-macpro
  • system-pi
  • system-sun-T5140
  • system-sun-V880
  • xsum-check.c
  • xsum-test.c
  • xsum-time-perm.c
  • xsum-time.c
  • xsum.c
  • xsum.h
  • (62 additional files not shown)
Current browse context:
math.NA
< prev   |   next >
new | recent | 2015-05
Change to browse by:
cs
cs.DC
cs.NA
stat
stat.CO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar

DBLP - CS Bibliography

listing | bibtex
Radford M. Neal
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack